Minimum-energy measures for singular kernels

نویسندگان

چکیده

We develop algorithms for energy minimization kernels with singularities. This problem arises in different fields, most notably the construction of space-filling sequences points where singularity guarantees a strong repelling property between these points. Numerical are based on approximating singular by non-singular ones, subsequent discretization and solving discrete problems. For kernels, we approximate an underlying completely monotone (briefly, CM) function bounded CM controlled accuracy. Theoretical properties suggested approximation studied some numerical results shown.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacitary Measures for Completely Monotone Kernels via Singular Control

We give a singular control approach to the problem of minimizing an energy functional for measures with given total mass on a compact real interval, when energy is defined in terms of a completely monotone kernel. This problem occurs both in potential theory and when looking for optimal financial order execution strategies under transient price impact. In our setup, measures or order execution ...

متن کامل

CAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS

In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...

متن کامل

Fourier Series for Singular Measures

Using the Kaczmarz algorithm, we prove that for any singular Borel probability measure μ on [0, 1), every f ∈ L2(μ) possesses a Fourier series of the form f (x) = ∑n=0 cne. We show that the coefficients cn can be computed in terms of the quantities f̂ (n) = ∫ 1 0 f (x)e −2πinxdμ(x). We also demonstrate a Shannon-type sampling theorem for functions that are in a sense μ-bandlimited.

متن کامل

Semigroup Kernels on Measures

We present a family of positive definite kernels on measures, characterized by the fact that the value of the kernel between two measures is a function of their sum. These kernels can be used to derive kernels on structured objects, such as images and texts, by representing these objects as sets of components, such as pixels or words, or more generally as measures on the space of components. Se...

متن کامل

Kernels and Similarity Measures for Text Classification

Measuring similarity between two strings is a fundamental step in text classification and other problems of information retrieval. Recently, kernel-based methods have been proposed for this task; since kernels are inner products in a feature space, they naturally induce similarity measures. Information theoretic (dis)similarities have also been the subject of recent research. This paper describ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2021

ISSN: ['0377-0427', '1879-1778', '0771-050X']

DOI: https://doi.org/10.1016/j.cam.2020.113089